The co-Pieri rule for stable Kronecker coefficients
نویسندگان
چکیده
We generalise the lattice word condition from Young tableaux to all Kronecker and hence calculate a large new family of stable coefficients.
منابع مشابه
A Pieri rule for skew shapes
The Pieri rule expresses the product of a Schur function and a single row Schur function in terms of Schur functions. We extend the classical Pieri rule by expressing the product of a skew Schur function and a single row Schur function in terms of skew Schur functions. Like the classical rule, our rule involves simple additions of boxes to the original skew shape. Our proof is purely combinator...
متن کاملA Pieri Rule for Hermitian Symmetric Pairs
Let (G, K) be a Hermitian symmetric pair and let g and k denote the corresponding complexified Lie algebras. Let g = k⊕ p+⊕ p− be the usual decomposition of g as a k-module. K acts on the symmetric algebra S(p−). We determine the K-structure of all K-stable ideals of the algebra. Our results resemble the Pieri Rule for Young diagrams. The result implies a branching rule for a class of finite di...
متن کاملEquivariant Pieri Rule for the homology of the affine Grassmannian
An explicit rule is given for the product of the degree two class with an arbitrary Schubert class in the torus-equivariant homology of the affine Grassmannian. In addition a Pieri rule (the Schubert expansion of the product of a special Schubert class with an arbitrary one) is established for the equivariant homology of the affine Grassmannians of SLn and a similar formula is conjectured for S...
متن کاملOn rectangular Kronecker coefficients
We show that rectangular Kronecker coefficients stabilize when the lengths of the sides of the rectangle grow, and we give an explicit formula for the limit values in terms of invariants of sln.
متن کاملKronecker Coefficients for Some Near-rectangular Partitions
We give formulae for computing Kronecker coefficients occurring in the expansion of sμ ∗ sν , where both μ and ν are nearly rectangular, and have smallest parts equal to either 1 or 2. In particular, we study s(n,n−1,1) ∗ s(n,n), s(n−1,n−1,1) ∗ s(n,n−1), s(n−1,n−1,2) ∗ s(n,n), s(n−1,n−1,1,1) ∗ s(n,n) and s(n,n,1) ∗ s(n,n,1). Our approach relies on the interplay between manipulation of symmetric...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2021
ISSN: ['0097-3165', '1096-0899']
DOI: https://doi.org/10.1016/j.jcta.2020.105297